A linear programming formulation for an inventory management decision problem with a service constraint
نویسندگان
چکیده
Inventory systems with uncertainty go hand in hand with the determination of a safety stock level. The decision on the safety stock level is based on a performance measure, for example the expected shortage per replenishment period or the probability of a stock-out per replenishment period. The performance measure assumes complete knowledge of the probability distribution during lead time, which might not be available. In case of incomplete information regarding the lead-time distribution of demand, no single figure for the safety stock can de determined in order to satisfy a performance measure. However, an optimisation model may be formulated in order to determine a safety stock level which guarantees the performance measure under the worst case of lead-time demand, of which the distribution is known in an incomplete way. It is shown that this optimisation problem can be formulated as a linear programming problem. 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
A Comprehensive Mathematical Model for a Location-routing-inventory Problem under Uncertain Demand: a Numerical Illustration in Cash-in-transit Sector
The purpose of this article is to model and solve an integrated location, routing and inventory problem (LRIP) in cash-in-transit (CIT) sector. In real operation of cash transportation, to decrease total cost and to reduce risk of robbery of such high-value commodity. There must be substantial variation, making problem difficult to formulate. In this paper, to better fit real life applications ...
متن کاملA parameter-tuned genetic algorithm for vendor managed inventory model for a case single-vendor single-retailer with multi-product and multi-constraint
This paper develops a single-vendor single-retailer supply chain for multi-product. The proposed model is based on Vendor Managed Inventory (VMI) approach and vendor uses the retailer's data for better decision making. Number of orders and available capital are the constraints of the model. In this system, shortages are backordered; therefore, the vendor’s warehouse capacity is another limitati...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملA mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Expert Syst. Appl.
دوره 38 شماره
صفحات -
تاریخ انتشار 2011